On the sensitivity of Lanczos recursions to the spectrum
نویسندگان
چکیده
We obtain novel, explicit formulas for the sensitivity of Jacobi matrices to small perturbations of their spectra. Our derivation is based on the connection between Lanczos’s algorithm and the discrete Gel’fand–Levitan inverse spectral method. We prove uniform stability of Lanczos recursions in discrete primitive norms, for perturbations of the eigenvalues relative to their separations. A stronger, l1 norm stability bound is also derived, under additional assumptions of rate of decay of the perturbations of the spectrum, which arise naturally for Sturm–Liouville operators. © 2004 Elsevier Inc. All rights reserved. AMS classification: 65F10; 65F15; 65F18; 34B24
منابع مشابه
An Implementation of the QMR Method Based on Coupled Two-Term Recurrences
Recently, the authors have proposed a new Krylov subspace iteration, the quasi-minimal residual algorithm (QMR), for solving non-Hermitian linear systems. In the original implementation of the QMR method, the Lanczos process with look-ahead is used to generate basis vectors for the underlying Krylov subspaces. In the Lanczos algorithm, these basis vectors are computed by means of three-term rec...
متن کاملLook-Ahead Procedures for Lanczos-Type Product Methods Based on Three-Term Lanczos Recurrences
Lanczos-type product methods for solving large sparse non-Hermitian linear systems have as residual polynomials either the squares of the Lanczos polynomials or the products of the latter with another sequence of polynomials, which is normally chosen to enforce some local minimization of the residual norm. In either case, these methods inherit from the underlying Lanczos process the danger of b...
متن کاملA Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions
A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...
متن کاملFast Algorithms for Toeplitz and Hankel Matrices
The paper gives a self-contained survey of fast algorithms for solving linear systems of equations with Toeplitz or Hankel coefficient matrices. It is written in the style of a textbook. Algorithms of Levinson-type and of Schur-type are discussed. Their connections with triangular factorizations, Padè recursions and Lanczos methods are demonstrated. In the case in which the matrices possess add...
متن کاملمقدمهای بر سیستمهای اسپینی کوانتمی
This manuscript is the collection of lectures given in the summer school on strongly correlated electron systems held at Isfahan university of technology, June 2007. A short overview on quantum magnetism and spin systems is presented. The numerical exact diagonalization (Lanczos) alghorithm is explained in a pedagogical ground. This is a method to get some ground state properties on finite clus...
متن کامل